Nets, Relations and Linking Diagrams
نویسنده
چکیده
In recent work, the author and others have studied compo-sitional algebras of Petri nets. Here we consider mathematical aspects of the pure linking algebras that underly them. We characterise composition of nets without places as the composition of spans over appropriate categories of relations, and study the underlying algebraic structures.
منابع مشابه
Linking diagrams for free
Linking diagrams with path composition are ubiquitous, for example: Temperley-Lieb and Brauer monoids, Kelly-Laplaza graphs for compact closed categories, and Girard’s multiplicative proof nets. We construct the category Link = Span(iRel), where iRel is the category of injective relations (reversed partial functions) and show that the aforementioned linkings, as well as Jones-Martin partition m...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملConsistent integration between object oriented and coloured petri nets models
Unified Modeling Language (UML) is easier to understand and communicate using graphical notations, but lacks techniques for model validation and verification especially if these diagrams are updated. Formal approaches like Coloured Petri Nets (CPNs) are based on strong mathematical notations and proofs as basis for executable modeling languages. Transforming UML diagrams to executable models th...
متن کاملSymbolic Analysis of Bounded Petri Nets
ÐThis work presents a symbolic approach for the analysis of bounded Petri nets. The structure and behavior of the Petri net is symbolically modeled by using Boolean functions, thus reducing reasoning about Petri nets to Boolean calculation. The set of reachable markings is calculated by symbolically firing the transitions in the Petri net. Highly concurrent systems suffer from the state explosi...
متن کاملIssues in Bayes Nets and Influence Diagrams: With Applications in Accounting and Auditing
Recently substantial research in artificial intelligence (AI) has focused on Bayes nets and the closely related influence diagrams. However, there has been little work in the accounting and auditing communi ties in this area of AI research. Bayes nets and influence diagrams have some advantages over deterministic AI approaches. These approaches employ probabilities to model decision making. Pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013